/**
*      author: Y_Yao
*      created: 2025-01-25 13:06:24
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 6;
int n;
int a[N];
stack<int> st;
int ans[N];
void solve()
{
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i];
    }

    for(int i = n;i >= 1;i--)
    {
        while(!st.empty() && a[i] > a[st.top()])
        {
            int j = st.top();
            st.pop();
        }
        st.push(i);
        ans[i-1] = st.size();
    }

    for(int i = 1;i <= n;i++)
    {
        cout << ans[i] << " ";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}